A reversible infinite HMM using normalised random measures

نویسندگان

  • David A. Knowles
  • Zoubin Ghahramani
  • Konstantina Palla
چکیده

We present a nonparametric prior over reversible Markov chains. We use completely random measures, specifically gamma processes, to construct a countably infinite graph with weighted edges. By enforcing symmetry to make the edges undirected we define a prior over random walks on graphs that results in a reversible Markov chain. The resulting prior over infinite transition matrices is closely related to the hierarchical Dirichlet process but enforces reversibility. A reinforcement scheme has recently been proposed with similar properties, but the de Finetti measure is not well characterised. We take the alternative approach of explicitly constructing the mixing measure, which allows more straightforward and efficient inference at the cost of no longer having a closed form predictive distribution. We use our process to construct a reversible infinite HMM which we apply to two real datasets, one from epigenomics and one ion channel recording.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recognition of unconstrained handwritten words using Markov random fields and HMMs

In this paper we present a system for recognition of handwritten words on literal check amounts which advantageously combines HMMs and Markov random fields (MRFs). It operates, in a holistic manner, at pixel level on height normalised word images which are viewed as random field realizations. The HMM analyses the image along the horizontal writing direction, in a specific state observation prob...

متن کامل

Using guide trees to construct multiple-sequence evolutionary HMMs

MOTIVATION Score-based progressive alignment algorithms do dynamic programming on successive branches of a guide tree. The analogous probabilistic construct is an Evolutionary HMM. This is a multiple-sequence hidden Markov model (HMM) made by combining transducers (conditionally normalised Pair HMMs) on the branches of a phylogenetic tree. METHODS We present general algorithms for constructin...

متن کامل

The Stochastic Random-cluster Process, and the Uniqueness of Random-cluster Measures

Geoffrey Grimmett Abstra t. The random-cluster model is a generalisation of percolation and ferromagnetic Potts models, due to Fortuin and Kasteleyn (see [29]). Not only is the random-cluster model a worthwhile topic for study in its own right, but also it provides much information about phase transitions in the associated physical models. This paper serves two functions. First, we introduce an...

متن کامل

Infinite–dimensional Diffusions as Limits of Random Walks on Partitions

The present paper originated from our previous study of the problem of harmonic analysis on the infinite symmetric group S∞. This problem leads to a family {Pz} of probability measures, the z–measures, which depend on the complex parameter z ∈ C. The z–measures live on the Thoma simplex, an infinite–dimensional compact space Ω which is a kind of dual object to the group S∞. The aim of the paper...

متن کامل

Speech enhancement based on hidden Markov model using sparse code shrinkage

This paper presents a new hidden Markov model-based (HMM-based) speech enhancement framework based on the independent component analysis (ICA). We propose analytical procedures for training clean speech and noise models by the Baum re-estimation algorithm and present a Maximum a posterior (MAP) estimator based on Laplace-Gaussian (for clean speech and noise respectively) combination in the HMM ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014